A lower bound for off-diagonal van der Waerden numbers
نویسندگان
چکیده
Article history: Received 3 November 2008 Accepted 2 January 2009 Available online 11 September 2009
منابع مشابه
Resolution Tunnels for Improved SAT Solver Performance
We show how to aggressively add uninferred constraints, in a controlled manner, to formulas for finding Van der Waerden numbers during search. We show that doing so can improve the performance of standard SAT solvers on these formulas by orders of magnitude. We obtain a new and much greater lower bound for one of the Van der Waerden numbers, specifically a bound of 1132 for W (2, 6). We believe...
متن کاملA New Method to Construct Lower Bounds for Van der Waerden Numbers
We present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this method we improved seven lower bounds. For natural numbers r, k and n a Van der Waerden certificate W (r, k, n) is a partition of {1, . . . , n} into r subsets, such that none of them contains an arithmetic progression of length k (or larger). Van der Waerden showed that given r an...
متن کاملThe 2-color relative linear Van der Waerden numbers
We define the r-color relative linear van der Waerden numbers for a positive integer r as generalizations of the polynomial van der Waerden numbers of linear polynomials. Especially we express a sharp upper bound of the 2-color relative linear van der Waerden number Rf2(u1, u2, . . . , um : s1, s2, . . . , sk) in terms of a (k + 1)-color polynomial van der Waerden number for positive integers m...
متن کاملBounds on some van der Waerden numbers
For positive integers s and k1,k2, . . . ,ks, the van der Waerden number w(k1,k2, . . . ,ks;s) is the minimum integer n such that for every s-coloring of set {1,2, . . . ,n}, with colors 1,2, . . . ,s, there is a ki-term arithmetic progression of color i for some i. We give an asymptotic lower bound for w(k,m;2) for fixed m. We include a table of values of w(k,3;2) that are very close to this l...
متن کاملImproving the Use of Cyclic Zippers in Finding Lower Bounds for van der Waerden Numbers
For integers k and l, each greater than 1, suppose that p is a prime with p ≡ 1 (mod k) and that the kth-power classes mod p induce a coloring of the integer segment [0, p− 1] that admits no monochromatic occurrence of l consecutive members of an arithmetic progression. Such a coloring can lead to a coloring of [0, (l − 1)p] that is similarly free of monochromatic l-progressions, and, hence, ca...
متن کامل